A complete closed form vectorial solution to the Kepler problem

The paper gives an exact vectorial solution to the Kepler problem. A vectorial regularization that linearizes the Kepler problem is given using a Sundman transformation. Closed form expressions describing the Keplerian motion are deduced. A unified approach to the classic Kepler problem is offered, by studying both rectilinear and non-rectilinear Keplerian motions with the same instrument. The approach is an elementary one and only simple vectorial computations are involved.     

The Quantum Regularization of Singular Black-Hole Solutions in Covariant Quantum Gravity

An excruciating issue that arises in mathematical, theoretical and astro-physics concerns the possibility of regularizing classical singular black hole solutions of general relativity by means of quantum theory. The problem is posed here in the context of a manifestly covariant approach to quantum gravity. Provided a non-vanishing quantum cosmological constant is present, here it is proved how a regular background space-time metric tensor can be obtained starting from a singular one. This is obtained by constructing suitable scale-transformed and conformal solutions for the metric tensor in which the conformal scale form factor is determined uniquely by the quantum Hamilton equations underlying the quantum gravitational field dynamics.     

Adding Prior Information in FWI through Relative Entropy

Full waveform inversion is an advantageous technique for obtaining high-resolution subsurface information. In the petroleum industry, mainly in reservoir characterisation, it is common to use information from wells as previous information to decrease the ambiguity of the obtained results. For this, we propose adding a relative entropy term to the formalism of the full waveform inversion. In this context, entropy will be just a nomenclature for regularisation and will have the role of helping the converge to the global minimum. The application of entropy in inverse problems usually involves formulating the problem, so that it is possible to use statistical concepts. To avoid this step, we propose a deterministic application to the full waveform inversion. We will discuss some aspects of relative entropy and show three different ways of using them to add prior information through entropy in the inverse problem. We use a dynamic weighting scheme to add prior information through entropy. The idea is that the prior information can help to find the path of the global minimum at the beginning of the inversion process. In all cases, the prior information can be incorporated very quickly into the full waveform inversion and lead the inversion to the desired solution. When we include the logarithmic weighting that constitutes entropy to the inverse problem, we will suppress the low-intensity ripples and sharpen the point events. Thus, the addition of entropy relative to full waveform inversion can provide a result with better resolution. In regions where salt is present in the BP 2004 model, we obtained a significant improvement by adding prior information through the relative entropy for synthetic data. We will show that the prior information added through entropy in full-waveform inversion formalism will prove to be a way to avoid local minimums.     

A Cahn-Hilliard model in a domain with non-permeable walls

We consider in this article a Cahn-Hilliard model in a bounded domain with non-permeable walls, characterized by dynamic-type boundary conditions. Dynamic boundary conditions for the Cahn-Hilliard system have recently been proposed by physicists in order to account for the interactions with the walls in confined systems and are obtained by writing that the total bulk mass is conserved and that there is a relaxation dynamics on the boundary. However, in the case of non-permeable walls, one should also expect some mass on the boundary. It thus seems more realistic to assume that the total mass, in the bulk and on the boundary, is conserved, which leads to boundary conditions of a different type. For the resulting mathematical model, we prove the existence and uniqueness of weak solutions and study their asymptotic behavior as time goes to infinity.     

第一类弱奇异核Fredholm积分方程的数值求解

第一类弱奇异核Fredholm积分方程由于奇异及本质的不适定性,给求解带来很大难度．本文首先利用克雷斯变换将方程转化,并对转化后的方程进行高斯一勒让德离散,得到一离散不适定的线性方程组,结合正则化方法对该类问题进行数值求解．最后给出了数值模拟,验证了本文方法的可行性及有效性．     

A total variation based approach to correcting surface coil magnetic resonance images

Magnetic resonance images which are corrupted by noise and by smooth modulations are corrected using a variational formulation incorporating a total variation like penalty for the image and a high order penalty for the modulation. The optimality system is derived and numerically discretized. The cost functional used is non-convex, but it possesses a bilinear structure which allows the ambiguity among solutions to be resolved technically by regularization and practically by normalizing the maximum value of the modulation. Since the cost is convex in each single argument, convex analysis is used to formulate the optimality condition for the image in terms of a primal-dual system. To solve the optimality system, a nonlinear Gauss-Seidel outer iteration is used in which the cost is minimized with respect to one variable after the other using an inner generalized Newton iteration. Favorable computational results are shown for artificial phantoms as well as for realistic magnetic resonance images. Reported computational times demonstrate the feasibility of the approach in practice.     

A coefficient identification problem for a mathematical model related to ductal carcinoma in situ

We consider a coefficient identification problem for a mathematical model with free boundary related to ductal carcinoma in situ (DCIS). This inverse problem aims to determine the nutrient consumption rate from additional measurement data at a boundary point. We first obtain a global‐in‐time uniqueness of our inverse problem. Then based on the optimization method, we present a regularization algorithm to recover the nutrient consumption rate. Finally, our numerical experiment shows the effectiveness of the proposed numerical method.     

A Flexible Framework for Cubic Regularization Algorithms for Nonconvex Optimization in Function Space

We propose a cubic regularization algorithm that is constructed to deal with nonconvex minimization problems in function space. It allows for a flexible choice of the regularization term and thus accounts for the fact that in such problems one often has to deal with more than one norm. Global and local convergence results are established in a general framework.     

Convergence results for a self-dual regularization of convex problems

We study a one-parameter regularization technique for convex optimization problems whose main feature is self-duality with respect to the Legendre–Fenchel conjugation. The self-dual technique, introduced by Goebel, can be defined for both convex and saddle functions. When applied to the latter, we show that if a saddle function has at least one saddle point, then the sequence of saddle points of the regularized saddle functions converges to the saddle point of minimal norm of the original one. For convex problems with inequality and state constraints, we apply the regularization directly on the objective and constraint functions, and show that, under suitable conditions, the associated Lagrangians of the regularized problem hypo/epi-converge to the original Lagrangian, and that the associated value functions also epi-converge to the original one. Finally, we find explicit conditions ensuring that the regularized sequence satisfies Slater's condition.